Generalized Buneman pruning for inferring the most parsimonious multi-state phylogeny

Accurate reconstruction of phylogenies remains a key challenge in evolutionary biology. Most biologically plausible formulations of the problem are formally NP-hard, with no known efficient solution. The standard in practice are fast heuristic methods that are empirically known to work very well in general, but can yield results arbitrarily far from optimal. Practical exact methods, which yield exponential worst-case running times but generally much better times in practice, provide an important alternative. We report progress in this direction by introducing a provably optimal method for the weighted multi-state maximum parsimony phylogeny problem. The method is based on generalizing the notion of the Buneman graph, a construction key to efficient exact methods for binary sequences, so as to apply to sequences with arbitrary finite numbers of states with arbitrary state transition weights. We implement an integer linear programming (ILP) method for the multi-state problem using this generalized Buneman graph and demonstrate that the resulting method is able to solve data sets that are intractable by prior exact methods in run times comparable with popular heuristics. Our work provides the first method for provably optimal maximum parsimony phylogeny inference that is practical for multi-state data sets of more than a few characters.Comment: 15 page

Meta-analysis of type 2 Diabetes in African Americans Consortium

Type 2 diabetes (T2D) is more prevalent in African Americans than in Europeans. However, little is known about the genetic risk in African Americans despite the recent identification of more than 70 T2D loci primarily by genome-wide association studies (GWAS) in individuals of European ancestry. In order to investigate the genetic architecture of T2D in African Americans, the MEta-analysis of type 2 DIabetes in African Americans (MEDIA) Consortium examined 17 GWAS on T2D comprising 8,284 cases and 15,543 controls in African Americans in stage 1 analysis. Single nucleotide polymorphisms (SNPs) association analysis was conducted in each study under the additive model after adjustment for age, sex, study site, and principal components. Meta-analysis of approximately 2.6 million genotyped and imputed SNPs in all studies was conducted using an inverse variance-weighted fixed effect model. Replications were performed to follow up 21 loci in up to 6,061 cases and 5,483 controls in African Americans, and 8,130 cases and 38,987 controls of European ancestry. We identified three known loci (TCF7L2, HMGA2 and KCNQ1) and two novel loci (HLA-B and INS-IGF2) at genome-wide significance (4.15 × 10(-94)<P<5 × 10(-8), odds ratio (OR)  = 1.09 to 1.36). Fine-mapping revealed that 88 of 158 previously identified T2D or glucose homeostasis loci demonstrated nominal to highly significant association (2.2 × 10(-23) < locus-wide P<0.05). These novel and previously identified loci yielded a sibling relative risk of 1.19, explaining 17.5% of the phenotypic variance of T2D on the liability scale in African Americans. Overall, this study identified two novel susceptibility loci for T2D in African Americans. A substantial number of previously reported loci are transferable to African Americans after accounting for linkage disequilibrium, enabling fine mapping of causal variants in trans-ethnic meta-analysis studies.Peer reviewe

A lookahead branch-and-bound algorithm for the maximum quartet consistency problem

Abstract. A lookahead branch-and-bound algorithm (LBnB) is proposed for solving the Maximum Quartet Consistency (MQC) Problem where the input is a complete set of quartets on the taxa and the goal is to construct a phylogeny that satisfies the maximum number of given quartets. It integrates a number of previous efforts on exact algorithms, heuristics, and approximation algorithms for the NP-hard MQC problem, and a few improved search techniques, especially a lookahead scheme, to solve the problem optimally. The theoretical running time analysis of the LBnB algorithm is provided, and an extensive simulation study has been well designed to compare the algorithm to previous existing exact algorithms and a best heuristic Hypercleaning. The experimental results on both synthetic and real datasets show that LBnB outperformed other exact algorithms, and it was competitive to Hypercleaning on many datasets.